Designing a solver competition: the QBFEVAL'10 case study
نویسندگان
چکیده
In this paper we report about QBFEVAL’10, the seventh in a series of events established with the aim of assessing the advancements in reasoning about quantified Boolean formulas (QBFs). The paper discusses the results obtained and the evaluation setup, from the criteria used to select QBF instances down to the hardware infrastructure. We also discuss the current state-of-the-art in light of past challenges and we envision future research directions that are motivated by the results of QBFEVAL’10.
منابع مشابه
SAT-to-SAT in QBFEval 2016
In this short paper, we describe QBF solvers from the latest QBFEval that were based on the SAT-to-SAT solver. We present the main ideas behind the solvers and discuss their strengths and weaknesses.
متن کاملExploiting Circuit Representations in QBF Solving
Previous work has shown that circuit representations can be exploited in QBF solvers to obtain useful performance improvements. In this paper we examine some additional techniques for exploiting a circuit representations. We discuss the techniques of propagating a dual set of values through the circuit, conversion from simple negation normal form to a more optimized circuit representation, and ...
متن کاملEvaluating QBF Solvers: Quantifier Alternations Matter
Competitions of quantified Boolean formula (QBF) solvers are an important driving force for solver development. We consider solvers and benchmarks in prenex conjunctive normal form (PCNF) that participated in the recent QBF competition (QBFEVAL’16) and take a fresh look at the number of solved instances as a measure of solver performance. Rather than ranking solvers by the total number of solve...
متن کاملExtracting and Checking Q-Resolution Proofs from a State-Of-The-Art QBF-Solver
The logic of Quantified Boolean Formulas (QBF) is an extension of propositional logic and provides compact encodings of real world problems in various fields of application, e.g., formal verification, reasoning and artificial intelligence. In recent years, the development of efficient decision procedures for QBF has progressed considerably. However, most current state-of-the-art QBF-solvers ret...
متن کاملDepQBF: A Dependency-Aware QBF Solver
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quantifier prefixes of QBFs in prenex conjunctive normal form (PCNF). DepQBF 0.1 was placed first in the main track of QBFEVAL’10 in a score-based ranking. We provide a general system overview and describe selected orthogo...
متن کامل